#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 100010;
char s[MAXN];
int main()
{
	int T, len;
	while(scanf("%s",s)!=EOF)
	{
		len = strlen(s);
		int ans = 1;
		for(int i = 0, j = len - 1; i < j; i++, j--)
		{
			if(s[i] != s[j])
			{
				ans = 0;
				break;
			}
		}
		if(ans)
			puts("Yes");
		else 
			puts("NO");
	}
	return 0;
}
